منابع مشابه
Backtracking based iterated tabu search for equitable coloring
An equitable k-coloring of an undirected graph G = (V,E) is a partition of its vertices into k disjoint independent sets, such that the cardinalities of any two independent sets differ by at most one. As a variant of the graph coloring problem (GCP), the equitable coloring problem (ECP) concerns finding a minimum k for which an equitable k-coloring exists. In this work, we propose a backtrackin...
متن کاملA Tabu Search Heuristic for the Equitable Coloring Problem
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem , current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic m...
متن کاملIterated Tabu Search: an Improvement to Standard Tabu Search
The goal of this paper is to discuss the tabu search (TS) meta-heuristic and its enhancement for combinatorial optimization problems. Firstly, the issues related to the principles and specific features of the standard TS are concerned. Further, a promising extension to the classical tabu search scheme is introduced. The most important component of this extension is a special kind of diversifica...
متن کاملIterated Robust Tabu Search for MAX-SAT
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in AI and other areas of computing science. In this paper, we present a new stochastic local search (SLS) algorithm for MAXSAT that combines Iterated Local Search and Tabu Search, two well-known SLS methods that have been...
متن کاملInformed Reactive Tabu Search for Graph Coloring
Tabu Search (TS) has always been a very popular algorithm for graph coloring, both as a stand-alone optimizer as well as a subroutine inside population-based hybrid methods. We present two TS extensions that could allow previous TS algorithms to improve their behavior at almost no additional computational cost. First, we integrate two new evaluation functions which employ supplementary (structu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Applications of Artificial Intelligence
سال: 2015
ISSN: 0952-1976
DOI: 10.1016/j.engappai.2015.09.008